Operations Preserving Global Rigidity of Generic Direction-Length Frameworks
نویسندگان
چکیده
A two-dimensional direction-length framework is a pair (G, p), where G = (V ;D,L) is a graph whose edges are labeled as ‘direction’ or ‘length’ edges, and a map p from V to R. The label of an edge uv represents a direction or length constraint between p(u) and p(v). The framework (G, p) is called globally rigid if every other framework (G, q) in which the direction or length between the endvertices of corresponding edges is the same, is ‘congruent’ to (G, p), i.e. it can be obtained from (G, p) by a translation and, possibly, a dilation by −1. We show that labeled versions of the two Henneberg operations (0extension and 1-extension) preserve global rigidity of generic directionlength frameworks. These results, together with appropriate inductive constructions, can be used to verify global rigidity of special families of generic direction-length frameworks.
منابع مشابه
Necessary Conditions for the Global Rigidity of Direction-Length Frameworks
It is an intriguing open problem to give a combinatorial characterisation or polynomial algorithm for determining when a graph is globally rigid in R. This means that any generic realisation is uniquely determined up to congruence when each edge represents a fixed length constraint. Hendrickson gave two natural necessary conditions, one involving connectivity and the other redundant rigidity. I...
متن کاملOn the universal rigidity of generic bar frameworks
In this paper, we present a sufficient condition for the universal rigidity of a generic bar framework G(p) in terms of the Gale matrix Z corresponding to G(p). We also establish a relationship between the stress matrix S and the Gale matrix Z for bar frameworks. This allows us to translate back and forth between S and Z in recently obtained results concerning universal rigidity, global rigidit...
متن کاملOperations preserving the global rigidity of graphs and frameworks in the plane
A straight-line realization of (or a bar-and-joint framework on) graph G in R is said to be globally rigid if it is congruent to every other realization of G with the same edge lengths. A graph G is called globally rigid in R if every generic realization of G is globally rigid. We give an algorithm for constructing a globally rigid realization of globally rigid graphs in R2. If G is triangle-re...
متن کاملGain-Sparsity and Symmetry-Forced Rigidity in the Plane
We consider planar bar-and-joint frameworks with discrete point group symmetry in which the joint positions are as generic as possible subject to the symmetry constraint. We provide combinatorial characterizations for symmetry-forced rigidity of such structures with rotation symmetry or dihedral symmetry of order 2k with odd k, unifying and extending previous work on this subject. We also explo...
متن کاملOn Global Rigidity and Universal Rigidity of Generic Bar Frameworks with Few Vertices
Gale transform was successfully used to classify polytopes with few vertices; that is, r-dimensional polytopes with r + k vertices, where k is small. In this paper, we use Gale transform to classify r-dimensional generic bar frameworks with r + k vertices, where k ≤ 4; as universally rigid, globally rigid or nonglobally rigid.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Comput. Geometry Appl.
دوره 20 شماره
صفحات -
تاریخ انتشار 2010